class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        m, n = len(text1), len(text2)
        dp = [[0] * (n + 1) for _ in range(m + 1)]
        for i in range(1, m+1):  # 列数
            for j in range(1, n+1):  # 行数
                if text1[i-1] == text2[j-1]:
                    dp[i][j] = dp[i-1][j-1] + 1  # 注意行和列的下标！！！
                else:
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1])
        return dp[m][n]


class Solution1:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        m, n = len(text1), len(text2)
        dp = [[0] * (m + 1) for _ in range(n + 1)]
        for j in range(n):
            for i in range(m):
                if text1[i] == text2[j]:
                    dp[j + 1][i + 1] = dp[j][i] + 1
                else:
                    dp[j + 1][i + 1] = max(dp[j][i + 1], dp[j + 1][i])
        return dp[n][m]


if __name__ == '__main__':
    x = Solution()
    print(x.longestCommonSubsequence('abcba', 'abcbcba'))
